package alg20241120;
//没写出来
public class Text2 {
    public int calculateMinimumHP(int[][] dungeon) {
        int m = dungeon.length;
        int n = dungeon[0].length;
        //1 创建表
        int[][] dp = new int[m+1][n+1];
        //2 初始化
        for (int i = 2; i <= m; i++) {
            dp[i][0] = Integer.MIN_VALUE;
        }
        for (int i = 2; i <= n; i++) {
            dp[0][i] = Integer.MIN_VALUE;
        }
        //3 填表
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]) + dungeon[i-1][j-1];
            }
        }
        //4 返回值
        return 0;
    }
}
